منابع مشابه
Stride Scheduling: Deterministic Proportional-Share Resource Management
This paper presents stride scheduling, a deterministic scheduling technique that efficiently supports the same flexible resource management abstractions introduced by lottery scheduling. Compared to lottery scheduling, stride scheduling achieves significantly improved accuracy over relative throughput rates, with significantly lower response time variability. Stride scheduling implements propor...
متن کاملDynamic Proportional Share Scheduling in Hadoop
We present the Dynamic Priority (DP) parallel task scheduler for Hadoop. It allows users to control their allocated capacity by adjusting their spending over time. This simple mechanism allows the scheduler to make more efficient decisions about which jobs and users to prioritize and gives users the tool to optimize and customize their allocations to fit the importance and requirements of their...
متن کاملConstant Bandwidth vs Proportional Share Resource Allocation
Due to the success of new multimedia technologies, there is a great interest for providing a resource allocation strategy suitable for multimedia applications. Many solutions proposed in literature are based on proportional share resource allocation, such as WFQ, WF2Q, EEVDF, or SFQ. In a previous paper, we showed how to perform resource reservation according to a Constant Bandwidth allocation....
متن کاملProportional-Share Scheduling for Distributed Storage Systems
Fully distributed storage systems have gained popularity in the past few years because of their ability to use cheap commodity hardware and their high scalability. While there are a number of algorithms for providing differentiated quality of service to clients of a centralized storage system, the problem has not been solved for distributed storage systems. Providing performance guarantees in d...
متن کاملBurst Round Robin as a Proportional-Share Scheduling Algorithm
In this paper we introduce Burst Round Robin, a proportional-share scheduling algorithm as an attempt to combine the low scheduling overhead of round robin algorithms and favor shortest jobs. As being documented that weight readjustment enables existing proportional share schedulers to significantly reduce, but not eliminate, the unfairness in their allocations. We present a novel weight adjust...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TOP
سال: 2007
ISSN: 1134-5764,1863-8279
DOI: 10.1007/s11750-007-0024-1